Improved the Convergence of Iterative Methods for Solving Systems of Equations by Memetics Techniques
نویسنده
چکیده
This work proposes proposed a technique inspired by memetic algorithm (MA) to improve the convergence of iterative methods for solving systems of equations. In the first phase the system of equations is transformed into an optimization problem. In this first phase, a memetics technique -ie a double optimization, local and globalis used to determine an initial vector favorable to a rapid convergence. In the second phase the system of equations is solved using an iterative method with the initial vector obtained in the previous phase. One can say that it is a hybrid method of solving systems of equations, both linear and nonlinear. The experimental results obtained with conjugate gradient, preconditioned conjugate gradient, Newton, Chebyshev and Broyden methods, serial and parallel versions, recommend the proposed method.
منابع مشابه
Preconditioned Generalized Minimal Residual Method for Solving Fractional Advection-Diffusion Equation
Introduction Fractional differential equations (FDEs) have attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. It is not always possible to find an analytical solution for such equations. The approximate solution or numerical scheme may be a good approach, particularly, the schemes in numerical linear algebra for solving ...
متن کاملSolving systems of nonlinear equations using decomposition technique
A systematic way is presented for the construction of multi-step iterative method with frozen Jacobian. The inclusion of an auxiliary function is discussed. The presented analysis shows that how to incorporate auxiliary function in a way that we can keep the order of convergence and computational cost of Newton multi-step method. The auxiliary function provides us the way to overcome the singul...
متن کاملFinite iterative methods for solving systems of linear matrix equations over reflexive and anti-reflexive matrices
A matrix $Pintextmd{C}^{ntimes n}$ is called a generalized reflection matrix if $P^{H}=P$ and $P^{2}=I$. An $ntimes n$ complex matrix $A$ is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix $P$ if $A=PAP$ ($A=-PAP$). In this paper, we introduce two iterative methods for solving the pair of matrix equations $AXB=C$ and $DXE=F$ over reflexiv...
متن کاملNew iterative methods with seventh-order convergence for solving nonlinear equations
In this paper, seventh-order iterative methods for the solution ofnonlinear equations are presented. The new iterative methods are developed byusing weight function method and using an approximation for the last derivative,which reduces the required number of functional evaluations per step. Severalexamples are given to illustrate the eciency and the performance of the newiterative methods.
متن کاملAn accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations
In this paper, an accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations is proposed. The convergence analysis of the algorithm is investigated. We show that the proposed algorithm converges to the exact solution for any initial value under certain assumptions. Finally, some numerical examples are given to demons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013